A Game-Theoretic Approach for Designing Mixed Mutation Strategies

Different mutation operators have been proposed in evolutionary programming. A mixture of various mutation operators may be more efficient than a single one. This paper presents a game-theoretic approach for designing evolutio nary programming with a mixed mutation strategy. The approach is applied to design a mixed strategy using Gaussian and Cauchy mutations. The experimental results show the mixed strategy can obtain the same performance as the best of pure strategies or even better in some cases.